Pattern Matching Strategies for Peephole Optimisation
نویسنده
چکیده
Peephole optimisation is a simple and effective optimisation technique used in conventional compilers. In classical peephole optimisers, optimisation rules are commonly applied through string pattern matching by means of regular expressions. This string-based approach to matching has proven to be very effective, but it is just the syntax of the assembly code input that is processed and its meaning gets lost. This dissertation explores alternatives to this classical approach: pattern matching for peephole optimisation is viewed as a procedure that is composed of a rule application strategy and a specific pattern matching strategy for matching within a rule. Two ‘generic’ matching strategies are developed in an OOP context to perform qualitatively better and more intelligent matching by utilising the meaning of the code. The results show that generic matching can yield better and even faster results than matching with mere regular expressions.
منابع مشابه
Peephole Optimization Technique for analysis and review of Compiler Design and Construction
In term of Compiler optimization, classical compilers implemented with an effective optimization technique called Peephole optimization. In the early stage of the implementation of this technique basically applied using string pattern matching performed on the regular expression and which are known as classical peephole optimizers. In the classical optimizers, the string pattern matching approa...
متن کاملPerformance-Oriented Peephole Optimisation of Balsa Dual-Rail Circuits
The transparency and flexibility of the syntax-directed compilation technique, as used in the Tangram (now Haste) and Balsa synthesis systems, comes at the cost of performance overhead. Some control resynthesis and peephole optimisation techniques have been proposed to reduce this performance penalty. In this paper, we introduce new peephole optimisations for Balsa dual-rail circuits. The metho...
متن کاملComparison of Optimisation Algorithms for Deformable Template Matching
In this work we examine in detail the use of optimisation algorithms on deformable template matching problems. We start with the examination of simple, direct-search methods and move on to more complicated evolutionary approaches. Our goal is twofold: first, evaluate a number of methods examined under different template matching settings and introduce the use of certain, novel evolutionary opti...
متن کاملOn the Discovery of Novel Drug - Target Interactions from Dense SubGraphs
Consensus Strategies applied to deduct a Mean of two Graph Correspondences 2 Speaker: Francesc Serratosa Abstract extract: Consensus strategies have been recently studied to help machine learning ensure better results. Likewise, optimisation in graph matching has been explored to accelerate and improve pattern recognition systems. We present a fast and simple consensus method which, given two c...
متن کاملNeed for Optimisation of Immunisation Strategies Targeting Invasive Meningococcal Disease in the Netherlands
Invasive meningococcal disease (IMD) is a severe bacterial infectious disease with high mortality and morbidity rates worldwide. In recent years, industrialised countries have implemented vaccines targeting IMD in their National Immunisation Programmes (NIPs). In 2002, the Netherlands successfully implemented a single dose of meningococcal serogroup C conjugate vaccine at the age of 14 months a...
متن کامل